Scheduling in Job-shop Type Production
نویسنده
چکیده
The Accessories Division of Thompson Products, Inc., is manufacturing hundreds of different types of assemblies including a variety of fUel pumps. The bulk of these products are manufactured in appropriate lot sizes to meet shipping commitments. As a part of a broad assignment to determine what role electronic data processors should play at Thompson Products, a study to improve this job-shop type produ·ction was initiated. The study began with a survey of the existing production control system, then the development of a mathematical model for a job-shop. type production scheduling system followed. This mathematical model allows the computation of start and completion dates for each operation on each parto It also establishes purchasing, labor, machine, and inventory requirements. Accomplishments as of today, include (1) a new scheduling system utilizing the concept of manufacturing bands has been installed, (2) a parts classification system has been established which balances the cost of inventory carrying against the cost of data processing, and (3) a feasibility study for the utilization of electronic computers has been completed, and the most suitable and economically attractive equipment for installation selected. SCHEDULING IN JOB-SHOP TYPE PRODUCTION
منابع مشابه
A Hierarchical Production Planning and Finite Scheduling Framework for Part Families in Flexible Job-shop (with a case study)
Tendency to optimization in last decades has resulted in creating multi-product manufacturing systems. Production planning in such systems is difficult, because optimal production volume that is calculated must be consistent with limitation of production system. Hence, integration has been proposed to decide about these problems concurrently. Main problem in integration is how we can relate pro...
متن کاملOptimality of the flexible job shop scheduling system based on Gravitational Search Algorithm
The Flexible Job Shop Scheduling Problem (FJSP) is one of the most general and difficult of all traditional scheduling problems. The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machine...
متن کاملOptimality of the flexible job shop scheduling system based on Gravitational Search Algorithm
The Flexible Job Shop Scheduling Problem (FJSP) is one of the most general and difficult of all traditional scheduling problems. The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machine...
متن کاملAn algorithm for multi-objective job shop scheduling problem
Scheduling for job shop is very important in both fields of production management and combinatorial op-timization. However, it is quite difficult to achieve an optimal solution to this problem with traditional opti-mization approaches owing to the high computational complexity. The combination of several optimization criteria induces additional complexity and new problems. In this paper, we pro...
متن کاملAn Improved Tabu Search Algorithm for Job Shop Scheduling Problem Trough Hybrid Solution Representations
Job shop scheduling problem (JSP) is an attractive field for researchers and production managers since it is a famous problem in many industries and a complex problem for researchers. Due to NP-hardness property of this problem, many meta-heuristics are developed to solve it. Solution representation (solution seed) is an important element for any meta-heuristic algorithm. Therefore, many resear...
متن کاملSimulation Modeling of Manufacturing Systems for the Serial Route and the Parallel One
In the paper we discuss the influence of the route flexibility degree, the open rate of operations and the production type coefficient on makespan. The flexible job-open shop scheduling problem FJOSP (an extension of the classical job shop scheduling) is analyzed. For the analysis of the production process we used a hybrid heuristic of the GRASP (greedy randomized adaptive search procedure) wit...
متن کامل